Cyclicity of graphs
نویسنده
چکیده
The cyclicity of a graph is the largest integer n for which the graph is contractible to the cycle on n vertices. By analyzing the cycle space of a graph, we establish upper and lower bounds on cyclicity. These bounds facilitate the computation of cyclicity for several classes of graphs, including chordal graphs, complete n-partite graphs, n-cubes, products of trees and cycles, and planar graphs. c © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 160–170, 1999
منابع مشابه
The cyclicity of a hypergraph
The cyclicity of a hypergraph is an efficiently computable integer that extends the notion of the cyclomatic number of a graph. Generalizing the notion of the degree of a node in a graph, we define the star articulation degree of a subedge in a hypergraph, and then use it to set up the expression for the cyclicity. The basic properties of cyclicity are that it is zero on acyclic hypergraphs and...
متن کاملThe cyclicity of a hypergraph
The cyclicity of a hypergraph is an e ciently computable integer that extends the notion of the cyclomatic number of a graph The formula for the cyclicity is suggested by the join invariant of an acyclic hypergraph which is the multiset of all joining sets in any of its join trees Once we gure out how the multiplicity of a joining set depends on the structure of the acyclic hypergraph we de ne ...
متن کاملOn a new cyclicity measure of graphs - The global cyclicity index
Being motivated in terms of mathematical concepts from the theory of electrical networks, Klein & Ivanciuc introduced and studied a new graph-theoretic cyclicity index–the global cyclicity index (Graph cyclicity, excess conductance, and resistance deficit, J. Math. Chem. 30 (2001) 271–287). In this paper, by utilizing techniques from graph theory, electrical network theory and real analysis, we...
متن کاملEfficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
We consider a list cost coloring of vertices and edges in the model of vertex, edge, total and pseudototal coloring of graphs. We use a dynamic programming approach to derive polynomial-time algorithms for solving the above problems for trees. Then we generalize this approach to arbitrary graphs with bounded cyclomatic numbers and to their multicolorings.
متن کاملContracting Bipartite Graphs to Paths and Cycles
Testing if a given graph G contains the k-vertex path Pk as a minor or as an induced minor is trivial for every fixed integer k ≥ 1. However, the situation changes for the problem of checking if a graph can be modified into Pk by using only edge contractions. In this case the problem is known to be NP-complete even if k = 4. This led to an intensive investigation for testing contractibility on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 1999